Heuristics and exact methods for number partitioning
نویسندگان
چکیده
Number partitioning is a classical NP-hard combinatorial optimization problem, whose solution is challenging for both exact and approximative methods. This work presents a new algorithm for number partitioning, based on ideas drawn from branch-and-bound, breadth first search, and beam search. A new set of benchmark instances for this problem is also proposed. The behavior of the new method on this and other test beds is analyzed and compared to other well known heuristics and exact algorithms.
منابع مشابه
A Threshold Accepting Algorithm for Partitioning Machines in a Tandem Automated Guided Vehicle
Abstract : A tandem automated guided vehicle (AGV) system deals with grouping workstations into some non-overlapping zones , and assigning exactly one AGV to each zone. This paper presents a new non-linear integer mathematical model to group n machines into N loops that minimizes both inter and intra-loop flows simultaneously. Due to computational difficulties of exact methods in solving our pr...
متن کاملThe Party Partitioning -library User Guide { Version 1.1
The problem of partitioning a graph into a number of pieces is one of the fundamental tasks in computer science and has a number of applications e.g. in parallel programming or VLSI design. Finding optimal partitions according to diierent measures is in most cases NP-complete. Nevertheless, a large number of eecient partitioning heuristics have been developed during recent years. The performanc...
متن کاملGraph Partitioning Using Genetic Algorithms
The eecient implementation of parallel processing ar-chitectures generally requires the solution of hard combi-natorial problems involving allocation and scheduling of tasks. Such problems can often be modelled with considerable accuracy as a graph partitioning problem|a problem well-known from complexity theory to be NP-hard, which implies that for practical purposes the global optimum will no...
متن کاملA bi-objective model for a scheduling problem of unrelated parallel batch processing machines with fuzzy parameters by two fuzzy multi-objective meta-heuristics
This paper considers a bi-objective model for a scheduling problem of unrelated parallel batch processing machines to minimize the makespan and maximum tardiness, simultaneously. Each job has a specific size and the data corresponding to its ready time, due date and processing time-dependent machine are uncertain and determined by trapezoidal fuzzy numbers. Each machine has a specific capacity,...
متن کاملPARTY - A Software Library for Graph Partitioning
The problem of partitioning a graph into a number of pieces is one of the fundamental tasks in computer science and has a number of applications e.g. in computational mechanics or VLSI design. Finding optimal partitions according to diierent measures is in most cases NP-complete. Nevertheless, a large number of eecient partitioning heuristics have been developed during recent years. The perform...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- European Journal of Operational Research
دوره 202 شماره
صفحات -
تاریخ انتشار 2010